排序方式: 共有172条查询结果,搜索用时 156 毫秒
21.
We consider the online scheduling of equal length jobs on unbounded parallel batch processing machines to minimize makespan with limited restart. In the problem \(m\) identical unbounded parallel batch processing machines are available to process the equal length jobs arriving over time. The processing batches are allowed limited restart. Here, “restart” means that a running task may be interrupted, losing all the work done on it, and the jobs in the interrupted task are then released and become independently unscheduled jobs, called restarted jobs. “Limited restart” means that only a running batch that contains no restarted jobs can be restarted. For this problem, we present a best possible online algorithm. 相似文献
22.
The 2-INTERVAL PATTERN problem is to find the largest constrained pattern in a set of 2-intervals. The constrained pattern
is a subset of the given 2-intervals such that any pair of them are R-comparable, where model . The problem stems from the study of general representation of RNA secondary structures. In this paper, we give three improved
algorithms for different models. Firstly, an O(n{log} n +L) algorithm is proposed for the case , where is the total length of all 2-intervals (density d is the maximum number of 2-intervals over any point). This improves previous O(n
2log n) algorithm. Secondly, we use dynamic programming techniques to obtain an O(nlog n + dn) algorithm for the case R = { <, ⊏ }, which improves previous O(n
2) result. Finally, we present another algorithm for the case with disjoint support(interval ground set), which improves previous O(n
2□n) upper bound.
A preliminary version of this article appears in Proceedings of the 16th Annual International Symposium on Algorithms and
Computation, Springer LNCS, Vol. 3827, pp. 412–421, Hainan, China, December 19–21, 2005. 相似文献
23.
Jinjiang Yuan Shisheng Li Ji Tian Ruyan Fu 《Journal of Combinatorial Optimization》2009,17(2):206-213
We consider a single batch machine on-line scheduling problem with delivery times. In this paper on-line means that jobs arrive over time and the characteristics of jobs are unknown until their arrival times. Once the processing
of a job is completed it is delivered to the destination. The objective is to minimize the time by which all jobs have been
delivered. For each job J
j
, its processing time and delivery time are denoted by p
j
and q
j
, respectively. We consider two restricted models: (1) the jobs have small delivery times, i.e., for each job J
j
, q
j
≤p
j
; (2) the jobs have agreeable processing and delivery times, i.e., for any two jobs J
i
and J
j
, p
i
>p
j
implies q
i
≥q
j
. We provide an on-line algorithm with competitive ratio
for both problems, and the results are the best possible.
Project supported by NSFC (10671183). 相似文献
24.
25.
基于不同战略导向的创新选择与控制方式研究 总被引:8,自引:0,他引:8
本文从战略导向的角度出发,研究了企业的创新选择和管理控制方式选择问题.从战略思维和组织学习两个方面对企业家导向和市场导向在创新程度和管理控制方式上的不同进行了分析,提出概念模型和理论假设.利用从10个省市不同行业得到的585家企业有效样本数据的分析,验证了本文的理论模型.分析结果表明,企业家导向更加注重突破式创新并通过战略控制对其进行管理,而市场导向更加注重渐进创新并通过财务控制对其进行管理.分析结果还表明虽然企业家导向与渐进创新没有直接关系,但却可以通过财务控制方式鼓励企业中渐进创新的出现. 相似文献
26.
27.
28.
互联网和电子商务的广泛应用与开展,为数字产品营销提供了巨大的市场空间.同时,数字产品独特的交易过程也使其营销过程不同与传统产品.本文探讨三种经典的营销模型4P、4C和4S应用到数字产品的营销时的适用性.在已有研究总结出的四条命题基础上,通过三种渠道收集了45个数字产品营销工具作为样本,采用分类方法将三种经典的营销模型作为分类框架,对样本进行分类比较研究,验证了提出的五条假设并发现了三条有意义的结论:其一,数字产品的可试性和其需要的营销工具数量显著相关;其二,三种营销模型对不同种类的数字产品存在适用性的差异;其三,在网络营销环境中,数字产品常用的传输模式(下载和交互)与其适宜的分销方式(网上商店和独立网站)之间存在因果关系. 相似文献
29.
30.
战略联盟模式选择的分析框架:资源、风险与结构模式间关系的概念模型 总被引:11,自引:0,他引:11
本文从公司在战略联盟中投入的不同种类资源的风险评价角度,综合考虑资源、风险及战略联盟的结构模式选择间的关系,形成了战略联盟结构模式选择的新的分析框架,提出了揭示三者间关系的概念模型及理论假说。本文认为,公司对战略联盟结构模式选择的偏好会受到管理者对未来公司在战略联盟中的各类风险的主观评价的影响,而公司对战略联盟投入的各类资源及其重要性是影响管理者对风险主观评价的重要因素。因此,应综合考虑战略联盟中所投入的不同种类资源及其所引发的风险大小以选择战略联盟的结构模式。 相似文献